Monotonicity of a quantum 2-Wasserstein distance
نویسندگان
چکیده
Abstract We study a quantum analogue of the 2-Wasserstein distance as measure proximity on set ? N density matrices dimension N . show that such (semi-)distances do not induce Riemannian metrics tangent bundle and are typically unitarily invariant. Nevertheless, we prove for = 2 dimensional Hilbert space (unique up to rescaling) is monotonous with respect any single-qubit operation solution transport problem essentially unique. Furthermore, $N \geqslant 3$?> ? 3 cost matrix proportional projector demonstrate monotonicity under arbitrary mixed unitary channels. Finally, provide numerical evidence which allows us conjecture invariant semi-distance all CPTP maps 3 4.
منابع مشابه
Wasserstein Distance Measure Machines
This paper presents a distance-based discriminative framework for learning with probability distributions. Instead of using kernel mean embeddings or generalized radial basis kernels, we introduce embeddings based on dissimilarity of distributions to some reference distributions denoted as templates. Our framework extends the theory of similarity of Balcan et al. (2008) to the population distri...
متن کاملThe Gromov-Wasserstein Distance: A Brief Overview
We recall the construction of the Gromov–Wasserstein distance and concentrate on quantitative aspects of the definition.
متن کاملA spectral notion of Gromov–Wasserstein distance and related methods
Article history: Received 12 February 2010 Revised 7 August 2010 Accepted 16 September 2010 Available online 29 September 2010 Communicated by Mauro Maggioni
متن کاملMinimax Distribution Estimation in Wasserstein Distance
The Wasserstein metric is an important measure of distance between probability distributions, with several applications in machine learning, statistics, probability theory, and data analysis. In this paper, we upper and lower bound minimax rates for the problem of estimating a probability distribution underWasserstein loss, in terms of metric properties, such as covering and packing numbers, of...
متن کاملDistributionally Robust Stochastic Optimization with Wasserstein Distance
Distributionally robust stochastic optimization (DRSO) is a robust approach to stochastic optimization problems in which the underlying distribution is not known exactly. It seeks a decision which hedges against the worst-case distribution in an ambiguity set, containing a family of distributions relevant to the considered problem. Unfortunately, the worst-case distributions resulting from many...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics A
سال: 2023
ISSN: ['1751-8113', '1751-8121']
DOI: https://doi.org/10.1088/1751-8121/acb9c8